This paper is a quantitative analysis on packet switched network with a viewto generalize load balancing and determination of appropriate routing algorithmin multipath environment. Several routing algorithms have been introduced forrouting of packets from source to destination. Some of them route packetsaccurately with increased workload and some of them drastically cut down theworkload. A few of them can find out a minimum workload deviation for both UDPand TCP packets. We simulated these approaches in a well defined simulator,analyzed and evaluated their performance. After expanding our analysis withvarying weights and number of paths we found that the recently proposed routingalgorithm Mixed Weighted Fair Routing (MWFR) outperforms the existing routingalgorithms by reducing the routing and network overhead and saving the scarcebandwidth as well as CPU consumption for packet switching networks.
展开▼
